The Turán Number for the Hexagon

نویسندگان

  • Assaf Naor
  • Jacques Verstraëte
چکیده

It is shown that the maximal number of edges in an n-vertex graph containing no cycle of length six has order of magnitude 12n 4/3.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Turán Number for the Hexagon

A long-standing conjecture in combinatorics, made by Erdős and Simonovits, is that the maximum number of edges in an n-vertex graph without a hexagon is asymptotically 1 2n 4/3 as n→∞. This conjecture corresponds to the asymptotic optimality of constructions of generalized quadrangles as a source of dense hexagon-free graphs. In this paper, we construct a counterexample to this conjecture. For ...

متن کامل

On the Six Node Hexagon Elements for Continuum Topology Optimization of Plates Carrying in Plane Loading and Shell Structures Carrying out of Plane Loading

The need of polygonal elements to represent the domain is gaining interest among structural engineers. The objective is to perform static analysis and topology optimization of a given continuum domain using the rational fraction type shape functions of six node hexagonal elements. In this paper, the main focus is to perform the topology optimization of two-dimensional plate structures using Evo...

متن کامل

Amino acids interacting with defected carbon nanotubes: ab initio calculations

The adsorption of a number of amino acids on a defected single-walled carbon nanotube (SWCNT) isinvestigated by using the density-functional theory (DFT) calculations. The adsorption energies andequilibrium distances are calculated for various configurations such as amino acid attaching to defectsites heptagon, pentagon and hexagon in defective tube and also for several molecular orientationswi...

متن کامل

Some Infinite Classes of Fullerene Graphs

A fullerene graph is a 3 regular planar simple finite graph with pentagon or hexagon faces. In these graphs the number of pentagon faces is 12. Therefore, any fullerene graph can be characterized by number of its hexagon faces. In this note, for any h > 1, we will construct a fullerene graph with h hexagon faces. Then, using the leapfrogging process we will construct stable fullerenes with 20 +...

متن کامل

Effect of GapSeal® as a Sealing Material on Microgap and Microleakage at External Hexagon Implant Connections Following Cyclic Loading: An In Vitro Study

Background and Aim: The mismatch of the implant-abutment connection can produce instant stress and microleakage which result in mechanical and biological complications. This study aimed to investigate the influence of GapSeal® as a sealing material on the extent of microgap and microleakage at the external hexagon implant platform following cyclic loading. Materials and Methods: Sixteen implan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003